New lower bounds for classical Ramsey numbers R(5,13) and R(5,14)
نویسندگان
چکیده
منابع مشابه
New Lower Bounds for 28 Classical Ramsey Numbers
We establish new lower bounds for 28 classical two and three color Ramsey numbers, and describe the heuristic search procedures used. Several of the new three color bounds are derived from the two color constructions; specifically, we were able to use (5, k)-colorings to obtain new (3, 3, k)-colorings, and (7, k)-colorings to obtain new (3, 4, k)-colorings. Some of the other new constructions i...
متن کاملNew lower bounds for two multicolor classical Ramsey numbers
We present an algorithm to find lower bounds for multicolor classical Ramsey numbers by using 2-normalized cyclic graphs of prime order, and use it to obtain new lower bounds for two multicolor classical Ramsey numbers: R(3, 3, 12) ≥ 182, R(3, 3, 13) ≥ 212.
متن کاملNew lower bounds of fifteen classical Ramsey numbers
An algorithm to compute lower bounds for the classical Ramsey numbers R(Ql' Q2," " Qn) is developed. The decompositions of each of fifteen complete graphs of prime order into n circulant graphs are constructed and their properties are studied by computer search. This leads to new lower bounds of eight multicolor and seven 2-color Ramsey numbers, namely, R(3, 3, 6) 2: 54, R(3, 3, 7) 2: 72, R(3, ...
متن کاملNew lower bounds of ten classical Ramsey numbers
Based on a study of basic properties of cyclic graphs of prime order, we give an algorithm for computing lower bounds of classical Ramsey numbers. Our algorithm reduces certain amount of computation of cyclic graphs of prime order, since only some of them normalized cyclic graphs require computation in our method. Using the algorithm, we construct ten cyclic graphs of prime order to obtain new ...
متن کاملNew lower bounds for hypergraph Ramsey numbers
The Ramsey number rk(s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1, . . . , N}, there are s integers such that every k-tuple among them is red, or n integers such that every k-tuple among them is blue. We prove the following new lower bounds for 4-uniform hypergraph Ramsey numbers: r4(5, n) > 2 n log n and r4(6, n) > 2 2 1/5 , where c is an absolute positive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1999
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(99)00089-0